Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform
نویسندگان
چکیده
We introduce a two-stage universal transform code for image compression. The code combines Karhunen-Lo eve transform coding with weighted universal bit allocation (WUBA) 1] in a two-stage algorithm analogous to the algorithm for weighted universal vector quantization (WUVQ) 2, 3]. The encoder uses a collection of transform / bit allocation pairs rather than a single transform / bit allocation pair (as in JPEG) or a single transform with a variety of bit allocations (as in WUBA). We describe both an encoding algorithm for achieving optimal compression using a collection of transform / bit allocation pairs and a technique for designing locally optimal collections of transform / bit allocation pairs. We demonstrate performance using the mean squared error distortion measure. On a sequence of combined text and gray scale images, the algorithm achieves up to 2 dB improvement over a JPEG style coder using the discrete cosine transform (DCT) and an optimal collection of bit allocations, up to 3 dB improvement over a JPEG style coder using the DCT and a single (optimal) bit allocation, up to 6 dB over an en-tropy constrained WUVQ with rst-and second-stage vector dimensions equal to 16 and 4 respectively, and up to 10 dB improvement over an entropy constrained vector quantizer (ECVQ) with vector dimension 4.
منابع مشابه
Comparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform
In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.
متن کاملComparative Study of a Discrete Linear Basis for Image Data Compression
Transform imlige data compression consists of dividing the image into a number of nonoverlapping subimage regions and quantizing and coding the transform of the data from each subimage. KarbunenLoeve, Hadamard, and Fourier transforms are most commonly used in transform image compression. This paper presents a new discrete linear transform for image compression which we use in conjunction with d...
متن کاملWeighted universal image compression
We describe a general coding strategy leading to a family of universal image compression systems designed to give good performance in applications where the statistics of the source to be compressed are not available at design time or vary over time or space. The basic approach considered uses a two-stage structure in which the single source code of traditional image compression systems is repl...
متن کاملOn the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression
We examine the rate-distortion performance and computational complexity of linear transforms for lossy data compression. The goal is to better understand the performance/complexity tradeoffs associated with using the Karhunen-Loeve transform (KLT) and its fast approximations. Since the optimal transform for transform coding is unknown in general, we investigate the performance penalties associa...
متن کاملSeparable Karhunen Loeve transforms for the weighted universal transform coding algorithm
The weighted universal transform code (WUTC) is a twostage transform code that replaces PEG’S single, non-optimal transform code with a jointly designed collection of transform codes to achieve good performance across a broader class of possible sources. Unfortunately, the performance gains of WUTC are achieved at the expense of s i w c a n t increases in computational complexity and larger cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995